Group signature revocable anonymity scheme for network monitoring
نویسندگان
چکیده
منابع مشابه
Group signature revocable anonymity scheme for network monitoring
Subscriber’s Privacy is in a constant conflict with security and accountability providing controls employed for network monitoring activities of service providers and enterprises. This paper presents the results of the author’s research in the field of distributed network security monitoring architectures and the proposal of such a system that incorporates cryptographic protocols and a group si...
متن کاملA Revocable Certificateless Signature Scheme
Certificateless public key cryptography (CLPKC), with properties of no key escrow and no certificate, has received a lot of attention since its invention. However, membership revocation in certificateless cryptosystem still remains a non-trivial problem: the existing solutions are not practical for use due to either a costly mediator or enormous computation (secret channel). In this paper, we p...
متن کاملRevocable Anonymity
Anonymity services in the EU may be forced by the new EU data retention directive to collect connection data and deanonymise some of their users in case of serious crimes. For this purpose, we propose a new privacy-friendly solution for incorporating revocation in an anonymous communication system. In contrast to other known methods, our scheme does not reveal the identity of a user to any othe...
متن کاملA revocable anonymity in Tor
This new protocol is based on the idea of introducing a revocable anonymity in Tor, which was presented in our recent paper entitled "Another Tor is possible". Compared to that previous paper, this present scheme simplify the first protocol and reduce the power of the directory server, while maintaining the ability for the Tor community, to break the anonymity of a sender in case of misconduct....
متن کاملShortening the Libert-Peters-Yung Revocable Group Signature Scheme by Using the Random Oracle Methodology
In EUROCRYPT 2012, Libert, Peters and Yung (LPY) proposed the first scalable revocable group signature (R-GS) scheme in the standard model which achieves constant signing/verification costs and other costs regarding signers are at most logarithmic in N , where N is the maximum number of group members. However, although the LPY R-GS scheme is asymptotically quite efficient, this scheme is not su...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annales UMCS, Informatica
سال: 2011
ISSN: 2083-3628,1732-1360
DOI: 10.2478/v10065-011-0020-9